翻訳と辞書 Words near each other ・ CREB1 ・ CREB3 ・ CREB5 ・ Crebain / Leviathan ・ CREBL1 ・ CREC ・ Crecchio ・ Crece ・ CreceChile ・ Crecente ・ Crecer de golpe ・ Crecora ・ Crecora/Manister GAA ・ Crecy (disambiguation) ・ CREDAI ・ Credal network ・ Credal set ・ Credan ・ Credant Technologies ・ Credaro ・ Crede, West Virginia ・ Credell Calhoun ・ Credence ・ Credence (film) ・ Credence (statistics) ・ Credence good ・ Credence Hospital ・ Credence Systems ・ Credence table ・ Credenda/Agenda Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Credal network ： ウィキペディア英語版 Credal network Credal networks are probabilistic graphical models based on imprecise probability. Credal networks can be regarded as an extension of Bayesian networks, where credal sets replace probability mass functions in the specification of the local models for the network variables given their parents. As a Bayesian network defines a joint probability mass function over its variables, a credal network defines a joint credal set. The way this credal set is defined depends on the particular notion of independence for imprecise probability adopted. Most of the research on credal networks focused on the case of strong independence. Given strong independence the joint credal set associated to a credal network is called its strong extension. Let $(X\_1,\backslash ldots,X\_n)$ denote a collection of categorical variables and $G$. If $K(X\_i\backslash mid\backslash pi\_i)$ is, for each $i=1,\backslash ldots,n$, a conditional credal set over $X\_i$, then the strong extension of a credal network is defined as follows: : $K(X\_1,\backslash ldots,X\_n)=\backslash mathrm\backslash$ where $\backslash mathrm$ denote the convex hull. ==Inference== Inference on a credal network is intended as the computation of the bounds of an expectation with respect to its strong extensions. When computing the bounds of a conditional event, inference is called updating. Say that the queried variable $X\_q$ and the observed variables are $X\_E$, the lower bound to be evaluated is: : $\backslash underline(x\_q\backslash mid\; x\_E)=\backslash min\_\; \backslash frac.$ Being a generalization of the same problem for Bayesian networks, updating with credal networks is a NP-hard task. Yet a number of algorithm have been specified. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Credal network」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.